skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Creators/Authors contains: "Drucker, Ben"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. A box-ball system is a collection of discrete time states. At each state, we have a collection of countably many boxes with each integer from 1 to n assigned to a unique box; the remaining boxes are considered empty. A permutation on n objects gives a box-ball system state by assigning the permutation in one-line notation to the first n boxes. After a finite number of steps, the system will reach a so-called soliton decomposition which has an integer partition shape. We prove the following: if the soliton decomposition of a permutation is a standard Young tableau or if its shape coincides with its Robinson–Schensted (RS) partition, then its soliton decomposition and its RS insertion tableau are equal. We study the time required for a box-ball system to reach a steady state. We also generalize Fukuda’s single-carrier algorithm to algorithms with more than one carrier. 
    more » « less